D istrib u ted G enom e

نویسندگان

  • David Hall
  • John Miller
  • Jonathan Arnold
  • Krys Kochut
  • Amit Sheth
  • Michael Weise
چکیده

Genome projects are very demanding undertakings and are often carried out collaboratively by multiple research centers There are many di erent types of tasks that must be performed both by re searchers and automated tools These include such activities as shot gun sequencing sequence nishing sequence similarity searches data annotation oligonucleotide synthesis library construction and data submission These individual tasks are organized into work ows that carry out a particular function such as providing an annotated se quence of a cosmid clone The individual tasks may be carried out at one or more of the participating institutions A single work ow may be spread across multiple research centers Creating software systems to support distributed work ows presents developers with a number of challenges such as coordinating the execution of applications run ning on di erent systems transporting data between systems inte grating legacy applications providing recovery mechanisms and cre ating user interfaces Additionally there will likely be frequent change to the organizational procedures especially in the early stages of a genome project This paper discusses using a general purpose work ow management system WfMS to address these challenges in the implementation of an information system that manages a geographi cally distributed genome project A prototype application built with the METEOR WfMS is described which is running on several systems at the University of Georgia

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gathering of Asynchronous Oblivious Robots with Limited Visibility

W e consid er a collection of rob ots wh ich are id entical (anonym ou s), h ave lim ited visib ility of th e environm ent, and no m em ory of th e p ast (ob liviou s); fu rth erm ore, th ey are totally asynch ronou s in th eir ac tions, com p u tations, and m ovem ents. W e sh ow th at, even in su ch a totally asynch ronou s setting , it is p ossib le for th e rob ots to g ath er in th e sam e...

متن کامل

Zagreb, multiplicative Zagreb Indices and Coindices of ‎graphs

‎Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...

متن کامل

Degree Sequen es of Optimally Edge-Conne ted Multigraphs

Let u; v be distin t verti es of a multigraph G with degrees d u and d v , respe tively. The number of edge-disjoint u; v-paths in G is bounded above by minfd u ; d v g. A multigraph G is optimally edgeonne ted if for all pairs of distin t verti es u and v this upper bound is a hieved. If G is a multigraph with degree sequen e D, then we say G is a realisation of D. We hara terize degree sequen...

متن کامل

Computing the Szeged index of 4,4 ׳-bipyridinium dendrimer

Let e be an edge of a G connecting the vertices u and v. Define two sets N1 (e | G) and N2(e |G) as N1(e | G)= {xV(G) d(x,u) d(x,v)} and N2(e | G)= {xV(G) d(x,v) d(x,u) }.The number of elements of N1(e | G) and N2(e | G) are denoted by n1(e | G) and n2(e | G) , respectively. The Szeged index of the graph G is defined as Sz(G) ( ) ( ) 1 2 n e G n e G e E    . In this paper we compute th...

متن کامل

AVENTINUS, GATE and Swedish Lingware

T his rep o rt p resen ts an o u tlin e o f th e S w ed ish L ingw are co m p o n en ts in teg ra ted in th e L anguage E n g in eerin g app lication d ev e lo p m en t en v iro n m en t o f G A T E . T h is is an o n g o in g w o rk w ithin th e fram ew o rk o f the L an g u ag e E n g in ee rin g p ro jec t A V E N T IN U S . A V E N T IN U S , A d v a n c e d In fo rm a tio n S ys tem fo r M...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999